A Constructor-based Approach for Positive/negative-conditional Equational Speciications
نویسندگان
چکیده
We present a constructor-based approach for assigning appropriate semantics to algebraic speciications given by nite sets of positive/negative-conditional equations. Under the assumption of con-uence of the reduction relation we deene, the factor algebra of the ground term algebra modulo the congruence of this reduction relation is a minimal model which is (beyond that) the minimum of all models that do not identify more constructor ground terms than necessary.
منابع مشابه
A Constructor-Based Approach for Positive/Negative-Conditional Equational Specifications
We study algebraic speciications given by nite sets R of positive/negative-conditional equations (i. e. universally quantiied rst-order implications with a single equation in the succedent and a conjunction of positive and negative (i. e. negated) equations in the antecedent). The class of models of such a speciication R does not contain in general a minimum model in the sense that it can be ma...
متن کاملOn Notions of Inductive
We deene and discuss various conceivable notions of induc-tive validity for rst-order equational clauses. This is done within the framework of constructor-based positive/negative conditional equational speciications which permits to treat negation and incomplete function deenitions in an adequate and natural fashion. Moreover, we show that under some reasonable assumptions all these notions are...
متن کاملCombining Algebraic and Set-theoretic Speciications ?
Speciication frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for deening (among other things) abstract data types using for-mulae of predicate logic and lambda-notation. In contrast, the so-called algebraic speciication frameworks often limit the type structure to sort constants and rst-order functionalities, and res...
متن کاملConditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
We propose a speciication language for the formalization of data types with partial or non-terminating operations as part of a rewrite-based logical framework for inductive theorem proving. The language requires constructors for designating data items and admits positive/negative conditional equations as axioms in speciications. The (total algebra) semantics for such speciications is based on s...
متن کاملOn Notions of Inductive Validity for First-Oder Equational Clauses
We define and discuss various conceivable notions of inductive validity for first-order equational clauses. This is done within the framework of constructor-based positive/negative conditional equational specifications which permits to treat negation and incomplete function definitions in an adequate and natural fashion. Moreover, we show that under some reasonable assumptions all these notions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994